Qualitative analysis of one-step iterative methods and consistent matrix splittings

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Qualitative analysis of one-step iterative methods and consistent matrix splittings

A qualitative analysis of one-step iterative methods is presented with special regard to the connection between concavity preservation and time-monotonicity. We also analyze the relation of one-step iterative methods to matrix splitting methods. c © 2007 Elsevier Ltd. All rights reserved.

متن کامل

Iterative methods based on splittings for stochastic automata networks

This paper presents iterative methods based on splittings (Jacobi, Gauss-Seidel, Successive Over Relaxation) and their block versions for Stochastic Automata Networks (SANs). These methods prove to be better than the power method that has been used to solve SANs until recently. With the help of three examples we show that the time it takes to solve a system modeled as a SAN is still substantial...

متن کامل

On the modified iterative methods for $M$-matrix linear systems

This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...

متن کامل

S-Step and Communication-Avoiding Iterative Methods

In this paper we make an overview of s-step Conjugate Gradient and develop a novel formulation for s-step BiConjugate Gradient Stabilized iterative method. Also, we show how to add preconditioning to both of these s-step schemes. We explain their relationship to the standard, block and communication-avoiding counterparts. Finally, we explore their advantages, such as the availability of matrix-...

متن کامل

‎Finite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices

A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$‎. ‎An $ntimes n$‎ ‎complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$)‎. ‎In this paper‎, ‎we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2008

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2007.11.002